The sum of two ϕ S orthogonal matrices when S −T S is normal and −1 ∉ σ ( S −T S )

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

NITROIMIDAZOLES VII [I]. SYNTHESES, ANTIBACTERIAL AND ANTIFUNGAL ACT I V I T I E S OF 4 - S U B S T I T U T E D - 2 - TWIAZOLYLHYDRAZONES

Reaction of readily available 2-formyl -1-methyl-5-nitroimidazole (1) with 4-substituted-2-hydrazinothiazoles (2) afforded 2-formyl-l-methyl-5- nitroimidazole 4-substituted -2- thiazolylhydrazones (3). Reaction of thiochromitn-4-one (4) with thiosemicarbazide gave thiochroman-4- one thiosemicarbazone (5). Reaction of compound 5 with clc- haloaldehyde or ketones y ielded thiochroman--#-one ...

Remmert , S . M . , Banks , S . T .

T L  C S C W S?

Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far away planet. Would their mathematics be setbased? What are the alternatives to the set-theoretic foundation of mathematics? Besides, set theory seems to play a significant role in computer science, in particular in database the...

[r,s,t] –رنگ آمیزی گراف ها

به ازای اعداد صحیح نامنفی r،s،t یک [r,s,t] –رنگ آمیزی گراف g=(v(g),e(g))، نگاشتی است مثل c ازاجتماع v(g) ?e (g) به مجموعه رنگ های {k-1 ،...،1،0} به طوری که : 1.برای هر دو راس مجاور vi وr vj ? | c(vi)-c(vj) | .2برای هر دو یال مجاور ei وej s ? | c(ei)-c(ej) | .3برای همه ی جفت راس ها و یال های هم وقوع t ? | c(vi)-c(ej) | عدد رنگی [r,s,t] ، r,s,t(g)? ،گراف g عبارتست از کوچک ترین عدد k به طوری...